Partial - Order Reduction in theWeak Modal Mu -

نویسنده

  • Scott A. Smolka
چکیده

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concur-rency Factory speciication and veriication environment; experimental results show that partial-order reduction can be highly eeective in combating state explosion in modal mu-calculus model checking.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong normalization of the second-order symmetric lambda mu -calculus

Parigot [12] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the second-order λμ-calculus with such rules.

متن کامل

Disjunctive bases: normal forms and model theory for modal logics

We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it m...

متن کامل

Disjunctive Bases: Normal Forms for Modal Logics

We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi. Believing the concept has a much wider significance, here we investigate it m...

متن کامل

An expressive completeness theorem for coalgebraic modal mu-calculi

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More specifically, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of the monadic second-order language for a given...

متن کامل

Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

We introduce basic partial order reduction techniques in a temporal-epistemic setting. We analyse the semantics of interpreted systems with respect to the notions of trace-equivalence for the epistemic linear time logic LTLK −X .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997